Discovering distorted repeating patterns in polyphonic music through longest increasing subsequences
نویسندگان
چکیده
We study the problem of identifying repetitions under transposition and time-warp invariances in polyphonic symbolic music. Using a novel onset-time-pair representation, we reduce repeating pat...
منابع مشابه
Discovering nontrivial repeating patterns in music data
A repeating pattern in music data is defined as a sequence of notes which appears more than once in a music object. The themes are a typical kind of repeating patterns. The themes and other nontrivial repeating patterns are important music features which can be used for both content-based retrieval of music data and music data analysis. In this paper, we propose two approaches for fast discover...
متن کاملOn longest increasing subsequences in random permutations
The expected value of L n , the length of the longest increasing subsequence of a random permutation of f1; : : : ; ng, has been studied extensively. This paper presents the results of both Monte Carlo and exact computations that explore the ner structure of the distribution of L n. The results suggested that several of the conjectures that had been made about L n were incorrect, and led to new...
متن کاملEnumerating Longest Increasing Subsequences and Patience Sorting Enumerating Longest Increasing Subsequences and Patience Sorting
In this paper we present three algorithms that solve three combinatorial optimization problems related to each other. One of them is the patience sorting game, invented as a practical method of sorting real decks of cards. The second problem is computing the longest monotone increasing subsequence of the given sequence of n positive integers in the range 1; : : : ; n. The third problem is to en...
متن کاملLongest increasing subsequences in sliding windows
We consider the problem of :nding the longest increasing subsequence in a sliding window over a given sequence (LISW). We propose an output-sensitive data structure that solves this problem in time O(n log log n+OUTPUT) for a sequence of n elements. This data structure substantially improves over the na?@ve generalization of the longest increasing subsequence algorithm and in fact produces an o...
متن کاملLongest Increasing Subsequences in Pattern-Restricted Permutations
Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limiting distributions for pattern-restricted permutations in which the pattern is any one of the six patterns of length 3. We show that the (132)-avoiding case is identical to the distribution of heights of ordered trees, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics and Music
سال: 2021
ISSN: ['1745-9737', '1745-9745']
DOI: https://doi.org/10.1080/17459737.2021.1896811